The bisection method for solving the nonlinear bar eigenvalue problem

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

An integral method for solving nonlinear eigenvalue problems

We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane. The method uses complex integrals of the resolvent operator, applied to at least k column vectors, where k is the number of eigenvalues inside the contour. The theorem of Keldysh is employed to show t...

The Shooting Method for Solving Eigenvalue Problems

The shooting method is a numerically effective approach to solving certain eigenvalue problems, such as that arising from the Schrödinger equation for the two-dimensional hydrogen atom with logarithmic potential function. However, no complete proof of its rationale and correctness has been given until now. This paper gives the proof, in a generalized form.

Solving nonlinear eigenvalue problems

A linear eigenvalue algorithm for the nonlinear eigenvalue problem

The Arnoldi method for standard eigenvalue problems possesses several attractive properties making it robust, reliable and efficient for many problems. Our first important result is a characterization of a general nonlinear eigenvalue problem (NEP) as a standard but infinite dimensional eigenvalue problem involving an integration operator denoted B. In this paper we present a new algorithm equi...